More about the closure of NP

The Closure of Monadic NP

It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic (Z i), which allows sentences consisting of a string of existential second-order quantifiers followed by a first-order formula. Monadic NP is the class of problems expressible in monadic Z ; , i.e., Z ; with the restriction that the second-order quan...

an investigation about the relationship between insurance lines and economic growth; the case study of iran

مطالعات قبلی بازار بیمه را به صورت کلی در نظر می گرفتند اما در این مطالعه صنعت بیمه به عنوان متغیر مستفل به بیمه های زندگی و غیر زندگی شکسته شده و هم چنین بیمه های زندگی به رشته های مختلف بیمه ای که در بازار بیمه ایران سهم قابل توجهی دارند تقسیم میشود. با استفاده از روشهای اقتصاد سنجی داده های برای دوره های 48-89 از مراکز ملی داده جمع آوری شد سپس با تخمین مدل خود بازگشتی برداری همراه با تعدادی ...

About the impossibility to prove P=NP or P!=NP and the pseudo-randomness in NP

The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P NP question and the “Deterministic” versus “Non Deterministic” nature of a problem, and more specifically at the temporal nature of the complexity within theNP class of problems. Let us remind that the NP class is called ...

Boolean NP-Partitions and Projective Closure

The "Game about Squares" is NP-hard

In the “Game about Squares” the task is to push unit squares on an integer lattice onto corresponding dots. A square can only be moved into one given direction. When a square is pushed onto a lattice point with an arrow the direction of the square adopts the direction of the arrow. Moreover, squares can push other squares. In this paper we study the decision problem, whether all squares can be ...